Recognizing Bundles in Time Table Graphs - A Structural Approach

Development of framework for sustainable Lean implementation: an ISM approach

The survival of any organization depends upon its competitive edge. Even though Lean is one of the most powerful quality improvement methodologies, nearly two-thirds of the Lean implementations results in failures and less than one-fifth of those implemented have sustained results. One of the most significant tasks of top management is to identify, understand and deploy the significant Lean pra...

Lexical Bundles in English Abstracts of Research Articles Written by Iranian Scholars: Examples from Humanities

This paper investigates a special type of recurrent expressions, lexical bundles, defined as a sequence of three or more words that co-occur frequently in a particular register (Biber et al., 1999). Considering the importance of this group of multi-word sequences in academic prose, this study explores the forms and syntactic structures of three- and four-word bundles in English abstracts writte...

Algorithm for Recognizing Cartesian Graph Bundles

Graph bundles generalize the notion of covering graphs and graph products. In [8], authors constructed an algorithm that ÿnds a presentation as a nontrivial Cartesian graph bundle for all graphs that are Cartesian graph bundles over triangle-free simple base. In [21], the unique square property is deÿned and it is shown that any equivalence relation possessing the unique square property determi...

Recognizing Cartesian graph bundles

Graph bundles generalize the notion of covering graphs and graph products. In this paper we extend some of the methods for recognizing Cartesian product graphs to graph bundles. Two main notions are used. The first one is the well-known equivalence relation δ defined on the edge-set of a graph. The second one is the concept of k-convex subgraphs. A subgraph H is k-convex in G, if for any two ve...

Re ognizing Bundles in Time Table Graphs